Algorithm 4. DCS pseudocode.

Considering a randomly generated initial candidate solution s:

begin DCS while (limit number of iterations not reached) do s' ← randomly generate a neighbor s' ÎN_|A|(s) and |s'| = |s|-1 s'' ← perform a one-bit local search for s';

   if f(s'') > f(s) then s ←s''

   end if end while returns end DCS